One-sided Versus Two-sided Error in Probabilistic Computation
نویسندگان
چکیده
We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RP PromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simpliies the proofs of the later result due to Andreev, Clementi and Rolim and Andreev, Clementi, Rolim and Trevisan. Clementi, Rolim and Trevisan question whether the promise is necessary for the above results, i.e., whether BPP RP RP for instance. We give a relativized world where P = RP 6 = BPP and thus the promise is indeed needed.
منابع مشابه
On probabilistic pushdown automata
We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than one-sided-error pda. Next one-sidederror pda are shown to be weaker than (nondeterministic) pda. Finally bounded error two-sided error pda and nondeterministic pda are incomparable. To show the li...
متن کاملAmplification of slight probabilistic advantage at absolutely no cost in space
Nondeterministic Turing acceptors can be viewed as probabilistic accep-tors with errors that are one-sided but not signiicantly bounded. In his seminal work on resource-bounded probabilistic Turing machines Gi77], Gill showed how to transform such a machine to one that does have a good error bound, at only modest cost in space usage. We describe a simpler transformation that incurs absolutely n...
متن کاملSpace Hierarchy Results for Randomized Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice. Previous works on hierarchy and separation theorems for such models focused on time as the resource. We obtain tighter results with space as the resource. Our main theorems are the following. Let s(n) be any spaceconstructible function that is Ω(log n) and such that s(an) = O(s(n...
متن کامل3 A Probabilistic Computation
There are two main ways to describe adding randomness to the computation of a Turing machine. Either you can say M has more than one transition function and non-deterministically chooses which one to use at a given state of computation or you can say that in addition to an input tape giving x, M has a tape r giving a sequence of random bits to assist in its computation of x. We will follow the ...
متن کامل